Accelerating Column Generation for a Survivable Network Design Problem
نویسندگان
چکیده
We consider a network design problem occurring in the extension of fiber optic networks on the last mile which generalizes the (Price Collecting) Steiner Tree Problem by introducing redundancy requirements on some customer nodes. In this work we present a formulation for this problem based on exponentially many variables and solve its linear relaxation by column generation. Using alternative dual-optimal solutions in the pricing problem we are able to significantly reduce the effects of typical efficiency issues of simplex based column generation. Computational results clearly show the advantages of our proposed strategy with respect to the number of pricing iterations needed as well as by means of required running times.
منابع مشابه
A Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملSurvivable Network Design: Routing of Flows and Slacks
We present a new mixed–integer programming model and a column generation method for the survivable design of telecommunication networks. In contrast to the failure scenario models, the new model has almost the same number of constraints as the regular network design problem, which makes it effective for large instances. Even though the complexity of pricing the exponentially many variables of t...
متن کاملA directed cycle-based column-and-cut generation method for capacitated survivable network design
A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here we present a polyhedral approach for designing survivable networks. We describe a mixed–integer programming model, in which sufficient slack is explicitly introduced on the directed cycles of the network while flow routing decisions are made. In case of ...
متن کاملOn the complexity of column generation in survivable network design with path-based survivability mechanisms
This paper deals with path-based linear programming formulations in survivable network design. In a recent survey we have investigated the complexity of the column generation problems for a large variety of protection and restoration mechanisms in a single or multiple link failure scenario, and classified them according to their structure. It turned out that all the considered column generation...
متن کاملColumn-Generation for Design of Survivable Electricity Distribution Networks
We investigate the problem of designing survivable electricity distribution networks subject to multiple, non-simultaneous link failures under a radial-network operating con guration. We formulate this problem as a two-stage stochastic mixed-integer program in which rst-stage decisions expand capacity; recourse decisions con gure the network to operate as a tree and to meet demand, by opening ...
متن کامل